Inertia theorem for general matrix equations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A comparison theorem for matrix Riccati difference equations

Difference equations of the form X ( t ) = F * ( t ) X ( t 1 ) F ( t ) F * ( t ) X ( t 1)G(t)[ l + G * ( t ) X ( t 1)G(t)]t G * ( t ) X ( t 1)F(t)+ Q(t ) and their associated Hermitian matrices H ( t ) = (0 v F* _C,C.)(t) are studied. Solution of different Riccati equations can be compared if the difference of their corresponding Hermitian matrices is semidefinite for all t. An application to t...

متن کامل

A General Realization Theorem for Matrix-valued Herglotz-nevanlinna Functions

New special types of stationary conservative impedance and scattering systems, the so-called non-canonical systems, involving triplets of Hilbert spaces and projection operators, are considered. It is established that every matrix-valued Herglotz-Nevanlinna function of the form

متن کامل

Inertia of the Matrix

Let p1, . . . , pn be positive real numbers. It is well known that for every r < 0 the matrix [(pi + pj) r ] is positive definite. Our main theorem gives a count of the number of positive and negative eigenvalues of this matrix when r > 0. Connections with some other matrices that arise in Loewner’s theory of operator monotone functions and in the theory of spline interpolation are discussed.

متن کامل

Inertia Theorems for Operator Lyapunov Equations

We study operator Lyapunov equations in which the innnitesimal generator is not necessarily stable; but it satisses a spectrum decomposition assumption and it has at most nitely many unstable eigenvalues. Under mild conditions; these have unique self-adjoint solutions. We give conditions under which the number of negative eigenvalues of this solution equals the number of unstable eigenvalues of...

متن کامل

Greedy low-rank methods for solving general linear matrix equations‡

This work is concerned with the numerical solution of large-scale linear matrix equations A1XB T 1 + · · ·+ AKXB K = C. The most straightforward approach computes X ∈ Rm×n from the solution of an mn×mn linear system, typically limiting the feasible values of m,n to a few hundreds at most. Our new approach exploits the fact that X can often be well approximated by a low-rank matrix. It combines ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1975

ISSN: 0022-247X

DOI: 10.1016/0022-247x(75)90170-5